Temporal Composite Actions with Constraints

نویسندگان

  • Patrick Doherty
  • Jonas Kvarnström
  • Andrzej Szalas
چکیده

Complex mission or task specification languages play a fundamentally important role in human/robotic interaction. In realistic scenarios such as emergency response, specifying temporal, resource and other constraints on a mission is an essential component due to the dynamic and contingent nature of the operational environments. It is also desirable that in addition to having a formal semantics, the language should be sufficiently expressive, pragmatic and abstract. The main goal of this paper is to propose a mission specification language that meets these requirements. It is based on extending both the syntax and semantics of a well-established formalism for reasoning about action and change, Temporal Action Logic (TAL), in order to represent temporal composite actions with constraints. Fixpoints are required to specify loops and recursion in the extended language. The results include a sound and complete proof theory for this extension. To ensure that the composite language constructs are adequately grounded in the pragmatic operation of robotic systems, Task Specification Trees (TSTs) and their mapping to these constructs are proposed. The expressive and pragmatic adequacy of this approach is demonstrated using an emergency response scenario.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a comprehensive treatment of repetitions, periodicity and temporal constraints in clinical guidelines

OBJECTIVE In this paper, we define a principled approach to represent temporal constraints in clinical guidelines and to reason (i.e., perform inferences in the form of constraint propagation) on them. We consider different types of constraints, including composite and repeated actions, and propose different types of temporal functionalities (e.g., temporal consistency checking). BACKGROUND C...

متن کامل

Deductive Planning and Composite Actions in Temporal Action Logic

Temporal Action Logic is a well established logical formalism for reasoning about action and change that has long been used as a formal specification language. Its first-order characterization and explicit time representation makes it a suitable target for automated theorem proving and the application of temporal constraint solvers. We introduce a translation from a subset of Temporal Action Lo...

متن کامل

Ensuring Consistent Termination of Composite Web Services

To reach a consistent termination state even in the presence of failures, composite web services require transactional support. Most current work on web services transactions is based on compensation. However, unlike in the traditional intra-organizational applications, the compensation is typically associated with temporal constraints in the context of web services. Such temporal constraints h...

متن کامل

Temporal Reasoning with Classes and Instances of Events

Representing and reasoning with both temporal constraints between classes of events (e.g., between the types of actions needed to achieve a goal) and temporal constraints between instances of events (e.g., between the specific actions being executed) is a ubiquitous task in many areas of computer science, such as planning, workflow, guidelines and protocol management. The temporal constraints b...

متن کامل

Temporal reasoning about composite and/or periodic events

In many application areas, including planning, workflow, guideline and protocol management, the description of the domain involves composite and/or periodic events, mutually related by temporal constraints on the execution order. Such events represent ‘classes’, since they can be instantiated to specific executions of the plan, guideline etc., and each execution must ‘respect’ the temporal cons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012